Perfect Sorting by Reversals Is Not Always Difficult
نویسندگان
چکیده
منابع مشابه
Perfect sorting by reversals is not always difficult ( Extended abstract ? )
This paper investigates the problem of conservation of combinatorial structures in genome rearrangement scenarios. We characterize a class of signed permutations for which one can compute in polynomial time a reversal scenario that conserves all common intervals, and that is parsimonious among such scenarios. The general problem is believed to be NP-hard. We show that there exists a class of pe...
متن کاملPerfect Sorting by Reversal is not Always Difficult
This paper investigates the problem of conservation of combinatorial structures in genome rearrangement scenarios. We characterize a class of signed permutations for which one can compute in polynomial time a reversal scenario that conserves all common intervals, and that is parsimonious among such scenarios. The general problem is believed to be NP-hard. We show that there exists a class of pe...
متن کاملPerfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that is, genes that are colocalised in several species, indicating that they remained grouped during evolution. A second largely studied problem related to gene order data is to compute a minimum scenario of reversals that...
متن کاملPerfect Sorting by Reversals and Deletions/Insertions
Recently, more and more people are interested in the problem of computing a sequence of rearrangement operations to transform one genome into the other such that these operations conserve all common intervals. Bérard et al. show an algorithm to solve the problem in subquadratic time when all operations are reversals. In this paper, we extend the result to allow deletions and a limited form of i...
متن کاملAverage-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show that, despite this worst-case analysis, with probability one, sorting can be done in polynomial time. Further, we find asymptotic expressions for the average...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Computational Biology and Bioinformatics
سال: 2007
ISSN: 1545-5963
DOI: 10.1109/tcbb.2007.1011